Queueing analysis of buffered switching networks

This paper provides a method for analyzing the queueing behavior of switching net works constructed from switches that employ shared bu ering or parallel bypass input bu er ing It extends the queueing models rst intro duced by Jenq and later generalized by Szyman ski and Shaikh to handle these classes of networks Our analysis explicitly models the state of an en tire switch and infers information about the dis tribution of packets associated with particular in puts or outputs when needed Earlier analyses of networks constructed from switches using input bu ering attempt to infer the state of a switch from the states of individual bu ers and cannot be directly applied to the networks of interest here Index Terms packet switching networks ATM networks queueing analysis